ARE PSEUDOPRIMES FOR ALMOST ALL PRIMES p
نویسنده
چکیده
It was proven by Emma Lehmer that for almost all odd primes p, F2p is a Fibonacci pseudoprime. In this paper, we generalize this result to Lucas sequences {Uk}. In particular, we find Lucas sequences {Uk} for which either U2p is a Lucas pseudoprime for almost all odd primes p or Up is a Lucas pseudoprime for almost all odd primes p.
منابع مشابه
Overpseudoprimes, Mersenne Numbers and Wieferich Primes
We introduce a new class of pseudoprimes-so called ”overpseudoprimes” which is a special subclass of super-Poulet pseudoprimes. Denoting via h(n) the multiplicative order of 2 modulo n,we show that odd number n is overpseudoprime if and only if the value of h(n) is invariant of all divisors d > 1 of n. In particular, we prove that all composite Mersenne numbers 2 − 1, where p is prime, and squa...
متن کاملOn the Number of Elliptic Pseudoprimes
For an elliptic curve E with complex multiplication by an order in K = Q('A-Ai), a point P of infinite order on E, and any prime p with (-d \ p) = —1, we have that (p + 1) • P = O(modp), where O is the point at infinity and calculations are done using the addition law for E. Any composite number which satisfies these conditions is called an elliptic pseudoprime. In this paper it is shown that, ...
متن کاملNotes on some new kinds of pseudoprimes
J. Browkin defined in his recent paper (Math. Comp. 73 (2004), pp. 1031–1037) some new kinds of pseudoprimes, called Sylow p-pseudoprimes and elementary Abelian p-pseudoprimes. He gave examples of strong pseudoprimes to many bases which are not Sylow p-pseudoprime to two bases only, where p = 2 or 3. In this paper, in contrast to Browkin’s examples, we give facts and examples which are unfavora...
متن کاملPseudoprime Reductions of Elliptic Curves
Let E be an elliptic curve over Q without complex multiplication, and for each prime p of good reduction, let nE(p) = |E(Fp)|. For any integer b, we are studying in this paper elliptic pseudoprimes to the base b. More precisely, let QE,b(x) be the number of primes p 6 x such that bE ≡ b (modnE(p)), and π E,b (x) be the number of compositive nE(p) such that b nE(p) ≡ b (modnE(p)) (also called el...
متن کاملThe Distribution of Pseudoprimes
The RSA crypto-system relies on the availability of very large prime numbers. Tests for finding these large primes can be categorized as deterministic and probabilistic. Deterministic tests, such as the Sieve of Erastothenes, offer a 100 percent assurance that the number tested and passed as prime is actually prime. Despite their refusal to err, deterministic tests are generally not used to fin...
متن کامل